Exact exponential-time algorithms for finding bicliques

نویسندگان

  • Daniel Binkele-Raible
  • Henning Fernau
  • Serge Gaspers
  • Mathieu Liedloff
چکیده

Due to a large number of applications, bicliques of graphs have been widely considered in the literature. This paper focuses on non-induced bicliques. Given a graph G = (V,E) on n vertices, a pair (X,Y ), with X,Y ⊆ V , X ∩ Y = ∅, is a non-induced biclique if {x, y} ∈ E for any x ∈ X and y ∈ Y . The NP-complete problem of finding a non-induced (k1, k2)-biclique asks to decide whether G contains a non-induced biclique (X,Y ) such that |X| = k1 and |Y | = k2. In this paper, we design a polynomial-space O(1.6914)time algorithm for this problem. It is based on an algorithm for bipartite graphs that runs in time O(1.30052). In deriving this algorithm, we also exhibit a relation to the spare allocation problem known from memory chip fabrication.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An exact exponential time algorithm for counting bipartite cliques

We present a simple exact algorithm for counting bicliques of given size in a bipartite graph on n vertices. We achieve running time of O(1.2491), improving upon known exact algorithms for finding and counting bipartite cliques.

متن کامل

Exact Exponential-Time Algorithms for Finding Bicliques in a Graph

Throughout the paper all graphs G = (V,E) are undirected and simple. An induced biclique of G is a complete bipartite induced subgraph of G. A noninduced biclique is a complete bipartite (not necessarily induced) subgraph of G. Equivalently, the pair (X, Y ) of disjoint vertex subsets X ⊆ V and Y ⊆ V is a non-induced biclique of G if {x, y} ∈ E for all x ∈ X and y ∈ Y . If, additionally, X and ...

متن کامل

On the Parameterized Complexity of Biclique Cover and Partition

Given a bipartite graph G, we consider the decision problem called BicliqueCover for a fixed positive integer parameter k where we are asked whether the edges of G can be covered with at most k complete bipartite subgraphs (a.k.a. bicliques). In the BicliquePartition problem, we have the additional constraint that each edge should appear in exactly one of the k bicliques. These problems are bot...

متن کامل

Solution to time fractional generalized KdV of order 2q+1 and system of space fractional PDEs

Abstract. In this work, it has been shown that the combined use of exponential operators and integral transforms provides a powerful tool to solve time fractional generalized KdV of order 2q+1 and certain fractional PDEs. It is shown that exponential operators are an effective method for solving certain fractional linear equations with non-constant coefficients. It may be concluded that the com...

متن کامل

A Change-Sensitive Algorithm for Maintaining Maximal Bicliques in a Dynamic Bipartite Graph

We consider the maintenance of maximal bicliques from a dynamic bipartite graph that changes over time due to the addition or deletion of edges. When the set of edges in a graph changes, we are interested in knowing the change in the set of maximal bicliques (the “change”), rather than in knowing the set of maximal bicliques that remain unaffected. The challenge in an efficient algorithm is to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 111  شماره 

صفحات  -

تاریخ انتشار 2010